List of contributors

This article examines Edward Lansdale's return to South Vietnam during the Johnson administration. Lansdale offered a persuasive critique of the mistakes the American policy in Vietnam, but his potential influence was severely limited by a combination of bureaucratic infighting in Saigon and a general indifference to the political aspects of the conflict in Washington. While Lansdale was unable to signiflcantly influence the policies of the Johnson administration, his experience in Saigon during 1965–68 offers historians a unique perspective on many facets of American and South Vietnamese policymaking during a crucial period of the Vietnam War.     

Insurgency online: Elements for a theory of anti‐government Internet communications

The article takes the cases of Peru's Tupac Amaru Revolutionary Movement (MRTA) as the pont of departure to discuss how a insurgent political movement uses the Internet and World Wide Web (WWW). During the 1996–97 Japanese Embassy hostage incident in Lima, Peru, MRTA supporters in Japan, Europe and North America used online technology to relay the group's message to a global public. The resulting direct media access provided the MRTA with an unprecendented level of global publicity. Through referring to the ‘MRTA Solidarity Page’, the types of message transmitted, the forms of transmission (text, video, audio, e‐mail or other), and target publics (national, global, political elites, media), the article outlines the issues and theoretical challenges raised by electronic anti‐government information provision. The Internet and WWW do not alone constitute the threat to state power as some analysts suggest but does in some sense dramatically alter political communication. New media will probably co‐exist with other forms of political communication for some time.     

Investigating the Desirability of Navy Aircraft Service Life Extension Programs

Building on prior work on optimal replacement of aging aircraft, this paper presents three methodologies to evaluate prospective aviation Service Life Extension Programs (SLEPs) and applies these methodologies to US Navy F/A-18E/F data. While considerable uncertainty remains as to the values of key parameters (e.g. the cost of F/A-18E/F SLEPs), the preponderance of the evidence available at this juncture favors undertaking SLEPs on F/A-18E/Fs rather than replacing them with new Joint Strike Fighters.     

What you should know about simulation and derivatives

Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016